16 research outputs found

    Image watermarking based on integer wavelet transform-singular value decomposition with variance pixels

    Get PDF
    With the era of rapid technology in multimedia, the copyright protection is very important to preserve an ownership of multimedia data. This paper proposes an image watermarking scheme based on Integer Wavelet Transform (IWT) and Singular Value Decomposition (SVD). The binary watermark is scrambled by Arnold transform before embedding watermark. Embedding locations are determined by using variance pixels. Selected blocks with the lowest variance pixels are transformed by IWT, thus the LL sub-band of 8�8 IWT is computed by using SVD. The orthogonal U matrix component of U3,1 and U4,1 are modified using certain rules by considering the watermark bits and an optimal threshold. This research reveals an optimal threshold value based on the trade-off between robustness and imperceptibility of watermarked image. In order to measure the watermarking performance, the proposed scheme is tested under various attacks. The experimental results indicate that our scheme achieves higher robustness than other scheme under different types of attack. Copyright © 2019 Institute of Advanced Engineering and Science. All rights reserved

    Spectrum Analysis of Speech Recognition via Discrete Tchebichef Transform

    Get PDF
    Speech recognition is still a growing field. It carries strong potential in the near future as computing power grows. Spectrum analysis is an elementary operation in speech recognition. Fast Fourier Transform (FFT) is the traditional technique to analyze frequency spectrum of the signal in speech recognition. Speech recognition operation requires heavy computation due to large samples per window. In addition, FFT consists of complex field computing. This paper proposes an approach based on discrete orthonormal Tchebichef polynomials to analyze a vowel and a consonant in spectral frequency for speech recognition. The Discrete Tchebichef Transform (DTT) is used instead of popular FFT. The preliminary experimental results show that DTT has the potential to be a simpler and faster transformation for speech recognition

    AuSR2: Image watermarking technique for authentication and self-recovery with image texture preservation

    Get PDF
    This paper presents an image watermarking technique for authentication and self-recovery called AuSR2. The AuSR2 scheme partitions the cover image into 3 × 3 non-overlapping blocks. The watermark data is embedded into two Least Significant Bit (LSB), consisting of two authentication bits and 16 recovery bits for each block. The texture of each block is preserved in the recovery data. Thus, each tampered pixel can be recovered independently instead of using the average block. The recovery process may introduce the tamper coincidence problem, which can be solved using image inpainting. The AuSR2 implements the LSB shifting algorithm to increase the imperceptibility by 2.8%. The experimental results confirm that the AuSR2 can accurately detect the tampering area up to 100%. The AuSR2 can recover the tampered image with a PSNR value of 38.11 dB under a 10% tampering rate. The comparative analysis proves the superiority of the AuSR2 compared to the existing scheme

    An application of hybrid swarm intelligence algorithms for dengue outbreak prediction

    Get PDF
    Dengue fever is a hazardous infectious disease which is channeled by Aedes mosquito. A serious infection of dengue may lead to a potentially lethal complication, known as severe dengue, which includes Dengue Haemorrhagic Fever and shock syndrome. In recent decades, this disease becomes a global burden which has grown dramatically around the world. Unfortunately, until today, a specific anti-viral medicine for dengue is still undiscovered. Therefore, it is a huge responsibility to the community in finding an effective solution to prevent a widespread of this disease in advance. Concerning this matter, this study presents an application of hybrid Swarm Intelligence (SI) algorithms for a dengue outbreak prediction. For simulation purposes, a monthly dengue cases time series data in the area of Indonesia were employed, which are fed to four hybrid SI algorithms, namely Moth Flame Optimization (MFO), Grey Wolf Optimizer (GWO), Firefly Algorithm (FA) and Artificial Bee Colony (ABC) algorithm. These algorithms are individually hybrid with Least Squares Support Vector Machines. Guided by Mean Square Error (MSE) and Root Mean Square Percentage Error (RMSPE), findings of the study indicate that the identified hybrid algorithms were able to produce competitive result, with a slightly favor to ABCLSSVM

    Multiple watermarking technique based on RDWT-SVD and human visual characteristics

    Get PDF
    With the increasing multimedia technology, digital watermarking technique is needed for copyright protection. The multiple watermarking technique is required for embedding more than one watermarks. A major challenge needs to be solved specially to recover multiple watermarks that may be destroyed due to JPEG compression. This paper proposed multiple embedding techniques for watermarks based on RDWT-SVD and human visual characteristics. The proposed scheme examines U(2,1) and U(3,1) components of RDWT-SVD. Our scheme uses Arnold transform to scramble the watermarks before embedding watermarks into the host image. The proposed scheme is tested under several attacks such as image compression, geometrical and image processing attacks. The experimental results show that our scheme can achieve a higher robustness for both recovered watermarks than the existing technique. Our scheme produces high robustness with the normalized-cross-correlation about 0.99 under noise additions. © 2005 � ongoing JATIT & LLS

    A blind watermarking technique using redundant wavelet transform for copyright protection

    Get PDF
    A digital watermarking technique is an alternative method to protect the intellectual property of digital images. This paper presents a hybrid blind watermarking technique formulated by combining RDWT with SVD considering a trade-off between imperceptibility and robustness. Watermark embedding locations are determined using a modified entropy of the host image. Watermark embedding is employed by examining the orthogonal matrix U obtained from the hybrid scheme RDWT-SVD. In the proposed scheme, the watermark image in binary format is scrambled by Arnold chaotic map to provide extra security. Our scheme is tested under different types of signal processing and geometrical attacks. The test results demonstrate that the proposed scheme provides higher robustness and less distortion than other existing schemes in withstanding JPEG2000 compression, cropping, scaling and other noises

    Efficient Discrete Tchebichef on Spectrum Analysis of Speech Recognition

    No full text
    Speech recognition is still a growing field of importance. The growth in computing power will open its strong potentials for full use in the near future. Spectrum analysis is an elementary operation in speech recognition. Fast Fourier Transform (FFT) has been a traditional technique to analyze frequency spectrum of the signals in speech recognition. FFT is computationally complex especially with imaginary numbers. The Discrete Tchebichef Transform (DTT) is proposed instead of the popular FFT. DTT has lower computational complexity and it does not require complex transform dealing with imaginary numbers. This paper proposes a novel approach based on 256 discrete orthonormal Tchebichef polynomials as efficient technique to analyze a vowel and a consonant in spectral frequency of speech recognition. The comparison between 1024 discrete orthonormal Tchebichef transform and 256 discrete orthonormal Tchebichef transform has been done. The preliminary experimental results show that 256 DTT has the potential to be more efficient to transform time domain into frequency domain for speech recognition. 256 DTT produces simpler output than 1024 DTT in frequency spectrum. At the same time, 256 Discrete Tchebichef Transform can produce concurrently four formants F1, F2, F3 and F4

    Handwritten character recognition using convolutional neural network

    Get PDF
    Handwritten character recognition (HCR) is the detection of characters from images, documents and other sources and changes them in machine-readable shape for further processing. The accurate recognition of intricate-shaped compound handwritten characters is still a great challenge. Recent advances in convolutional neural network (CNN) have made great progress in HCR by learning discriminatory characteristics from large amounts of raw data. In this paper, CNN is implemented to recognize the characters from a test dataset. The main focus of this work is to investigate CNN capability to recognize the characters from the image dataset and the accuracy of recognition w implementation is experimented with the dataset NIST to obtain the accuracy of handwritten characters. Test result provides that an accuracy of 92.91% accuracy is obtained on 200 images with a training set of 1000 images from NIST
    corecore